A Rewrite Stack Machine for Roc! a Rewrite Stack Machine for Roc! *
نویسندگان
چکیده
ROC! is a deterministic rewrite strategy language which includes the rewrite rulesas basic operators, and the deterministic choice and the repetition as high-level strategyoperators. In this paper we present a method which, for a given term rewriting system(TRS) R, constructs a new TRS R such that R-rewriting is equivalent (sound and com-plete) with R-rewriting constrained by ROC! . Since R uses a stack, it is called a rewritestack machine.
منابع مشابه
Concurrent Turing Machines as Rewrite Theories
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) khead Turing machines. Concurrent Turing machines correspond to a class of multiset rewriting systems. The definition of a CTMs as a rewrite theory avoids the need for encoding multisets as words and using...
متن کاملPynini: A Python library for weighted finite-state grammar compilation
We present Pynini, an open-source library for the compilation of weighted finitestate transducers (WFSTs) and pushdown transducers (PDTs) from strings, contextdependent rewrite rules, and recursive transition networks. Pynini uses the OpenFst library for encoding, modifying, and applying WFSTs and PDTs. We describe the design of this library and the algorithms and interfaces used for compilatio...
متن کاملOn Computing Reachability Sets of Process Rewrite Systems
We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). These systems are natural models for multithreaded...
متن کاملar X iv : 1 50 2 . 05 87 3 v 2 [ cs . F L ] 2 5 Fe b 20 15 Annotated Stack Trees ∗
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems – a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs ...
متن کاملPushdown systems in Polarized deduction modulo
We introduce a new saturation method for polarized rewrite systems and prove a cut-elimination theorem for the Polarized sequent calculus modulo a saturated rewrite system. As a corollary of this cut-elimination theorem, we obtain the decidability of reachability in alternating pushdown systems.
متن کامل